#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
const int N = 500010;
using ll = long long;
struct Node
{
    int l, r;
    ll sum, d;
}tr[N * 4];
ll w[N];
int n, m;
ll gcd(ll a, ll b)
{
    return b ? gcd(b, a % b) : a;
}
void pushup(Node& u, Node& l, Node& r)
{
    u.sum = l.sum + r.sum;
    u.d = gcd(l.d, r.d);
}
void pushup(int u)
{
    pushup(tr[u], tr[u << 1], tr[u << 1 | 1]);
}
void build(int u, int l, int r)
{
    if (l == r)
    {
        ll b = w[r] - w[r - 1];
        tr[u] = { l,r,b,b };
    }
    else
    {
        tr[u] = { l,r };
        int mid = l + r >> 1;
        build(u << 1, l, mid);
        build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }
}
void modify(int u, int x, ll v)
{
    if (tr[u].l == tr[u].r)
    {
        ll b = tr[u].sum + v;
        tr[u] = { x,x,b,b };
    }
    else
    {
        int mid = tr[u].l + tr[u].r >> 1;
        if (x <= mid) modify(u << 1, x, v);
        else modify(u << 1 | 1, x, v);
        pushup(u);
    }
}
Node query(int u, int l, int r)
{
    if (tr[u].l >= l && tr[u].r <= r) return tr[u];
    int mid = tr[u].l + tr[u].r >> 1;
    if (r <= mid) return query(u << 1, l, r);
    else if (l > mid) return query(u << 1 | 1, l, r);
    else
    {
        auto left = query(u << 1, l, r);
        auto right = query(u << 1 | 1, l, r);
        Node res;
        pushup(res, left, right);
        return res;
    }
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> w[i];
    build(1, 1, n);
    while (m--)
    {
        char op[2];
        int l, r;
        ll v;
        cin >> op >> l >> r;
        if (*op == 'Q')
        {
            auto left = query(1, 1, l);
            if (l == r) cout << abs(left.sum) << endl;
            else
            {
                auto right = query(1, l + 1, r);
                cout << abs(gcd(left.sum, right.d)) << endl;
            }
        }
        else
        {
            cin >> v;
            modify(1, l, v);
            if (r + 1 <= n) modify(1, r + 1, -v);
        }
    }
    return 0;
}